A Notion of Functional Completeness for First Order Structures II: Quasiprimality
نویسندگان
چکیده
Quasi-varieties of first-order structures were studied by N. Weaver [7] to generalize varieties of algebras; he also established some Malcev like conditions for these classes of structures. Following this line we extend some results of functional completeness of algebras to firstorder structures. Specifically, we formulate and characterize a notion of quasiprimality for first-order structures.
منابع مشابه
A notion of functional completeness for first-order structure
Using -congruences and implications, Weaver (1993) introduced the concepts of prevariety and quasivariety of first-order structures as generalizations of the corresponding concepts for algebras. The notion of functional completeness on algebras has been defined and characterized by Burris and Sankappanavar (1981), Kaarli and Pixley (2001), Pixley (1996), and Quackenbush (1981). We study the not...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملA Note on Generalized Functional Completeness in the Realm of Elementary Logic
In “Logicality and Invariance” (2008), Denis Bonnay introduced a generalized notion of functional completeness. In this note we call attention to an alternative characterization that is both natural and elementary. 1. Maximizing the expressive power of a logic Let L be a logic whose logical vocabulary contains truth-functional connectives (possibly infinitary ones), the first-order quantifiers ...
متن کاملComplexity of Fractran and Productivity
In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarantee that every finite part of the result can be evaluated in finitely many steps. This is known as productivity. For programming with infinite structures, productivity is what termination in well-defined results is for programmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007